Optimized code generation for finite element local assembly using symbolic manipulation
نویسندگان
چکیده
منابع مشابه
A Optimized Code Generation for Finite Element Local Assembly Using Symbolic Manipulation
Automated code generators for finite element local assembly have facilitated exploration of alternative implementation strategies within generated code. However, even for a theoretical performance indicator such as operation count, an optimal strategy for local assembly is unknown. We explore a code generation strategy based on symbolic integration and polynomial common sub-expression eliminati...
متن کاملSymbolic Manipulation of Code Properties
The FAdo system is a symbolic manipulator of formal languages objects, implemented in Python. In this work, we extend its capabilities by implementing methods to manipulate transducers and we go one level higher than existing formal language systems and implement methods to manipulate objects representing classes of independent languages (widely known as code properties). Our methods allow user...
متن کاملAutomated generation and symbolic manipulation of tensor product finite elements
We describe and implement a symbolic algebra for scalar and vector-valued finite elements, enabling the computer generation of elements with tensor product structure on quadrilateral, hexahedral and triangular prismatic cells. The algebra is implemented as an extension to the domain-specific language UFL, the Unified Form Language. This allows users to construct many finite element spaces beyon...
متن کاملHigh-level User Input Specifications for Finite Element Code Generation
A set of input specifications is designed to enable engineers and scientists, who may not be computer experts, to describe the finite element analysis (FEA) procedures for a new application. The input directs PIER, a code derivation/generation system being developed in Common Lisp, to produce either sequential or parallel FEA codes. The PIER input employs common terminology and notations as use...
متن کاملAutomatic Test Generation for String Manipulation Programs using Symbolic Execution
S ymbolic execution of string manipulation programs is challenging as the constraint solvers do not typically support logic over strings and non-string operations. KLEE[1] is a symbolic execution tool used to generate test cases with high coverage. It uses Simple Theorem Prover (STP) as its constraint solver. STP encodes constraints only as bit-vector logic and solves the constraints. It has no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Mathematical Software
سال: 2013
ISSN: 0098-3500,1557-7295
DOI: 10.1145/2491491.2491496